Efficient Parallel Algorithms for Parabolic Problems
نویسندگان
چکیده
منابع مشابه
Efficient Parallel Algorithms for Parabolic Problems
Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied for steady state or slow unsteady computation. Implicit schemes are used in order to march with large time steps. Parallelization is realized by approximating interface values using explicit computation. Various techniques are examined, including a multistep second order explicit scheme and a one-...
متن کاملParallel Fault Tolerant Algorithms for Parabolic Problems
With increasing number of processors available on nowadays high performance computing systems, the mean time between failure of these machines is decreasing. The ability of hardware and software components to handle process failures is therefore getting increasingly important. The objective of this paper is to present a fault tolerant approach for the implicit forward time integration of parabo...
متن کاملA Parallel Smoothing Technique for Parabolic Problems
A method is examined to approximate the interface conditions for Chebyshev polynomial approximations to the solutions of parabolic problems, and a smoothing technique is used to calculate the interface conditions for a domain decomposition method. The method uses a polynomial of one less degree than the full approximation to calculate the rst derivative so that interface values can be calculate...
متن کاملSpace-Efficient Parallel Algorithms for Combinatorial Search Problems
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an n-node tree of height h under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a distributed-memory machine with p processor...
متن کاملEfficient Parallel Algorithms for String Editing and Related Problems
The string editing problem for input strings z and y consists of transforming z into y by performing a series of weighted edit operations on z of overall minimum cost. An edit operation on z can be the deletion of a symbol from z, the insertion of a symbol in z or the substitution of a symbol of z with another symbol. This problem has a well known O( Izllvl) time sequential solution [25]. We gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2002
ISSN: 0036-1429,1095-7170
DOI: 10.1137/s0036142900381710